A branch-and-cut algorithm for the dial-a-ride problemCORDEAU, Jean-Francois.Operations research. 2006, Vol 54, Num 3, pp 573-586, issn 0030-364X, 14 p.Article

A tabu search heuristic for the static multi-vehicle dial-a-ride problemCORDEAU, Jean-Francois; LAPORTE, Gilbert.Transportation research. Part B : methodological. 2003, Vol 37, Num 6, pp 579-594, issn 0191-2615, 16 p.Article

A parallel iterated tabu search heuristic for vehicle routing problemsCORDEAU, Jean-François; MAISCHBERGER, Mirko.Computers & operations research. 2012, Vol 39, Num 9, pp 2033-2050, issn 0305-0548, 18 p.Article

Branch and Cut and Price for the Pickup and Delivery Problem with Time WindowsROPKE, Stefan; CORDEAU, Jean-François.Transportation science. 2009, Vol 43, Num 3, pp 267-286, issn 0041-1655, 20 p.Article

Iterated tabu search for the car sequencing problem : The car sequencing problemCORDEAU, Jean-Francois; LAPORTE, Gilbert; PASIN, Federico et al.European journal of operational research. 2008, Vol 191, Num 3, pp 945-956, issn 0377-2217, 12 p.Article

A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup timesSTECCO, Gabriella; CORDEAU, Jean-Francois; MORETTI, Elena et al.Computers & operations research. 2008, Vol 35, Num 8, pp 2635-2655, issn 0305-0548, 21 p.Article

A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problemMERCIER, Anne; CORDEAU, Jean-Francois; SOUMIS, Francois et al.Computers & operations research. 2005, Vol 32, Num 6, pp 1451-1476, issn 0305-0548, 26 p.Article

The pickup and delivery traveling salesman problem with first-in-first-out loadingERDOGAN, Günes; CORDEAU, Jean-Francois; LAPORTE, Gilbert et al.Computers & operations research. 2009, Vol 36, Num 6, pp 1800-1808, issn 0305-0548, 9 p.Article

A tabu search heuristic for the generalized minimum spanning tree problemONCAN, Temel; CORDEAU, Jean-Francois; LAPORTE, Gilbert et al.European journal of operational research. 2008, Vol 191, Num 2, pp 306-319, issn 0377-2217, 14 p.Article

The multi-depot vehicle routing problem with inter-depot routesCREVIER, Benoit; CORDEAU, Jean-Francois; LAPORTE, Gilbert et al.European journal of operational research. 2007, Vol 176, Num 2, pp 756-773, issn 0377-2217, 18 p.Article

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraintsCOSTA, Alysson M; CORDEAU, Jean-Francois; LAPORTE, Gilbert et al.European journal of operational research. 2008, Vol 190, Num 1, pp 68-78, issn 0377-2217, 11 p.Article

The Attractive Traveling Salesman ProblemERDOGAN, Güneş; CORDEAU, Jean-François; LAPORTE, Gilbert et al.European journal of operational research. 2010, Vol 203, Num 1, pp 59-69, issn 0377-2217, 11 p.Article

Integrated operations planning and revenue management for rail freight transportationCREVIER, Benoit; CORDEAU, Jean-François; SAVARD, Gilles et al.Transportation research. Part B : methodological. 2012, Vol 46, Num 1, pp 100-119, issn 0191-2615, 20 p.Article

Stochastic uncapacitated hub locationCONTRERAS, Ivan; CORDEAU, Jean-François; LAPORTE, Gilbert et al.European journal of operational research. 2011, Vol 212, Num 3, pp 518-528, issn 0377-2217, 11 p.Article

The Dynamic Uncapacitated Hub Location ProblemCONTRERAS, Ivan; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Transportation science. 2011, Vol 45, Num 1, pp 18-32, issn 0041-1655, 15 p.Article

The inventory-routing problem with transshipmentCOELHO, Leandro C; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Computers & operations research. 2012, Vol 39, Num 11, pp 2537-2548, issn 0305-0548, 12 p.Article

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loadingCORDEAU, Jean-François; DELL'AMICO, Mauro; IORI, Manuel et al.Computers & operations research. 2010, Vol 37, Num 5, pp 970-980, issn 0305-0548, 11 p.Article

Dynamic pickup and delivery problemsBERBEGLIA, Gerardo; CORDEAU, Jean-François; LAPORTE, Gilbert et al.European journal of operational research. 2010, Vol 202, Num 1, pp 8-15, issn 0377-2217, 8 p.Article

Consistency in multi-vehicle inventory-routingCOELHO, Leandro C; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Transportation research. Part C, Emerging technologies. 2012, Vol 24, pp 270-287, issn 0968-090X, 18 p.Article

Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity LevelsCONTRERAS, Ivan; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Transportation science. 2012, Vol 46, Num 4, pp 439-459, issn 0041-1655, 21 p.Article

Benders Decomposition for Large-Scale Uncapacitated Hub LocationCONTRERAS, Ivan; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Operations research. 2011, Vol 59, Num 6, pp 1477-1490, issn 0030-364X, 14 p.Article

A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping ProblemERDOGAN, Güneş; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Discrete applied mathematics. 2010, Vol 158, Num 15, pp 1599-1614, issn 0166-218X, 16 p.Article

Heuristics for dynamic and stochastic inventory-routingCOELHO, Leandro C; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Computers & operations research. 2014, Vol 52, pp 55-67, issn 0305-0548, 13 p., aArticle

Robust Inventory Routing Under Demand UncertaintySOLYAL, Oguz; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Transportation science. 2012, Vol 46, Num 3, pp 327-340, issn 0041-1655, 14 p.Article

An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delaysHEILPORN, Géraldine; CORDEAU, Jean-François; LAPORTE, Gilbert et al.Discrete applied mathematics. 2011, Vol 159, Num 9, pp 883-895, issn 0166-218X, 13 p.Article